Market Equilibrium via a Primal-Dual-Type Algorithm
نویسندگان
چکیده
Although the study of market equilibria has occupied center stage within Mathematical Economics for over a century, polynomial time algorithms for such questions have so far evaded researchers. We provide the first such algorithm for the linear version of a problem defined by Irving Fisher in 1891. Our algorithm is modeled after Kuhn’s primaldual algorithm for bipartite matching.
منابع مشابه
Computing Equilibria in a Fisher Market with Linear Single-Constraint Production Units
We study the problem of computing equilibrium prices in a Fisher market with linear utilities and linear single-constraint production units. This setting naturally appears in ad pricing where the sum of the lengths of the displayed ads is constrained not to exceed the available ad space. There are three approaches to solve market equilibrium problems: convex programming, auction-based algorithm...
متن کاملA distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods
In this paper, we propose a distributed primal-dual algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over network systems. In the considered game, not only each player’s local objective function depends on other players’ decisions, but also the feasible decision sets of all the players are coupled together with a globally shared affine inequality constra...
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملPrimal-Dual Method for Searching Equilibrium in Hierarchical Congestion Population Games
In this paper, we consider a large class of hierarchical congestion population games. One can show that the equilibrium in a game of such type can be described as a minimum point in a properly constructed multi-level convex optimization problem. We propose a fast primal-dual composite gradient method and apply it to the problem, which is dual to the problem describing the equilibrium in the con...
متن کاملPrimal/dual Positive Math Programming: Illustrated through an Evaluation of the Impacts of Market Resistance to Genetically Modified Grains
The goal of Howitt’s positive mathematical programming procedure is to calibrate a mathematical programming model so that it will reproduce a set of base data for the primal variables. This article develops an analogous procedure allowing one to specify the levels of both primal and dual variables. This article also sheds light on a potential ambiguity of Howitt’s procedure (with attendant poli...
متن کامل